minimum n. (pl. minimums, -ma ) 最小,最低,最少限度;【数学】极小(值)。 the irreducible minimum 无法减少的最小限度。 The thermometer reached the minimum for the year. 寒暑表降到当年最低度数。 adj. 最少的,最小的,最低的。 the minimum value 【数学】极小值。
path path(ol.) =pathological; pathology. n. (pl. paths ) 1.(自然踏成的)路;路径;(马路边上的)人行道;(车子走不过的)小路;(竞走或自行车比赛的)跑道。 2.路线;路程;〔比喻〕(人生的)道路;(思想、行为、生活的)途径,方式。 3.【天文学】道,带。 approach path 【航空】进场航线。 moon's path 【天文学】白道。 path of a total eclipse 【天文学】全蚀带。 a path strewn with roses 撒满玫瑰的道路,安乐的一生。 a beaten path 踏出来的[走惯的]路;常规,普通方法。 break [blaze] a (new) path 开辟一条(新)路。 cross sb.'s path 碰见某人;挡住某人去路,阻碍某人。 set sb.on the right path 使某人走上正路。 path-breaker 开路人;闯将。 adj. -less 无路的,人迹未到的。
A method to calculate the minimum path sets between two nodes in a network 一种计算网络两点间最小路集的方法
Combining the international newest research result of multicast tree, this paper get a series of high efficiency arithmetic of multicast tree problem with the method of increasing storage space, and this paper also takes into account the dynamic capability of arithmetic . in many research fields of multicast tree, many high-efficiency solutions were obtained in this paper . this paper has broadly discussed about multicast tree problem and obtained dmdt ( dynamic minimum distance tree ), fmph ( fast minimum path cost heuristic ), dmph ( dynamic minimum path cost heuristic ) and fgmra ( fast group multicast routing arithmetic ) 本篇论文对多播生成树问题进行了比较全面的讨论,涉及内容包括单约束的单树多播、单约束的成组多播等多个方面,所提出的动态最短路径树算法dmdt(dynamicminimumdistancetree),最小代价多播生成树算法fmph(fastminimumpathcostheuristic)动态最小代价多播生成树算法dmph(dynamicminimumpathcostheuristic),成组多播快速路由算法fgmra(fastgroupmulticastroutingarithmetic),都取得了显著的效果,是目前同类问题中比较好的解决方案,达到了预期的目的。
Combining the international newest research result of multicast tree, this paper get a series of high efficiency arithmetic of multicast tree problem with the method of increasing storage space, and this paper also takes into account the dynamic capability of arithmetic . in many research fields of multicast tree, many high-efficiency solutions were obtained in this paper . this paper has broadly discussed about multicast tree problem and obtained dmdt ( dynamic minimum distance tree ), fmph ( fast minimum path cost heuristic ), dmph ( dynamic minimum path cost heuristic ) and fgmra ( fast group multicast routing arithmetic ) 本篇论文对多播生成树问题进行了比较全面的讨论,涉及内容包括单约束的单树多播、单约束的成组多播等多个方面,所提出的动态最短路径树算法dmdt(dynamicminimumdistancetree),最小代价多播生成树算法fmph(fastminimumpathcostheuristic)动态最小代价多播生成树算法dmph(dynamicminimumpathcostheuristic),成组多播快速路由算法fgmra(fastgroupmulticastroutingarithmetic),都取得了显著的效果,是目前同类问题中比较好的解决方案,达到了预期的目的。